HEURISTIC ALGORITHMS FOR A SINGLE-MACHINE COMMON DUE DATE ASSIGNMENT UNDER EARLINESS/TARDINESS MEASURE
نویسندگان
چکیده
منابع مشابه
Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment
We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.
متن کاملAn efficient meta-heuristic for the single machine common due date scheduling problem
A new meta-heuristic for scheduling multiple jobs on a single machine so that they are completed by a common specified date (neither earlier, nor later) is addressed in this paper. Costs are set depending on whether a job finished before (earliness), or after (tardiness) the specified due date. The objective is to minimize the total weighted earliness and tardiness penalized costs from the spec...
متن کاملBatch Scheduling and Common Due-date Assignment on a Single Machine
We consider the problem of scheduling n groups of jobs on a single machine where three types of decisions are combined: scheduling, batching and due-date assignment. Each group includes identical jobs and may be split into batches; jobs within each batch are processed jointly. A sequence independent machine set-up time is needed between each two consecutively scheduled batches of different grou...
متن کاملSingle-Machine Scheduling with Due-Date Assignment and Aging Effect under a Deteriorating Maintenance Activity Consideration
This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating maintenance activity consideration simultaneously. The maintenance activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the maintenance activity has been co...
متن کاملGenetic Algorithms for Single Machine Job Scheduling with Common Due Date and Symmetric Penalties
A single machine n-job scheduling problem is examined to minimize sum of absolute deviations of completion times from a common due date. Simple and hybrid genetic Algorithms are developed by investigating basic operators for the applications of job sequencing problems. For the simple genetic algorithm two heuristic crossover schemes: Algorithm VASX and Algorithm VADX are developed based on impo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1993
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.36.121